Transforming a graph into a 1-balanced graph
نویسندگان
چکیده
منابع مشابه
Transforming a graph into a 1-balanced graph
Let G be a non-trivial, loopless graph and for each non-trivial subgraph H of G, let g(H) = |E(H)| |V(H)|−ω(H) . The graph G is 1-balanced if γ(G), the maximum among g(H), taken over all nontrivial subgraphs H of G, is attained when H = G. This quantity γ(G) is called the fractional arboricity of the graph G. The value γ(G) appears in a paper by Picard and Queyranne and has been studied extensi...
متن کاملBalanced and 1-balanced graph constructions
In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier's archiving and manuscript policies are encouraged to visit: Keywords: Balanced graphs 1-balanced graphs Cartesian product of graphs Web graphs a b s t r a c t There are several density...
متن کاملTransforming Graph Based Scenarios into Graph Transformation Based JUnit Tests
This paper describes how the Fujaba CASE tool supports a semi-automatic transformation of usecase scenarios specified by so called story boards into automatic test specifications and test implementations. A story board is a sequence of graph snapshots showing the evolution of a graph based object structure during a typical example execution of an usecase. From such an example execution we autom...
متن کاملTransforming a random graph drawing into a Lombardi drawing
The visualization of any graph plays important role in various aspects, such as graph drawing software. Complex systems (like large databases or networks) that have a graph structure should be properly visualized in order to avoid obfuscation. One way to provide an aesthetic improvement to a graph visualization is to apply a force-directed drawing algorithm to it. This method, that emerged in t...
متن کاملCall-Graph Caching: Transforming Programs into Networks
There are computer programs that use the same flow of control when run on different inputs. This redundancy in their program execution traces can be exploited by preserving suitably abstracted call-graphs for subsequent reuse. We introduce a new programming transformation Call-Graph Caching (CGC) which partially evaluates the control flow of sets of such programs into a network formed from thei...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2009
ISSN: 0166-218X
DOI: 10.1016/j.dam.2008.03.012